Fitness Landscapes and Performance of Meta-heuristics
نویسندگان
چکیده
We perform a statistical analysis of the structure of the search space of some planar, euclidian instances of the traveling salesman problem. We want to depict this structure from the point of view of iterated local search algorithms. The objective is two-fold: understanding the experimentally known good performance of metaheuristics on the TSP and other combinatorial optimization problems; designing new techniques to search the space more efficiently. This work actually led us to design a hybrid genetic algorithm that competes rather well with other local search heuristics for the TSP, notably Jünger’s et al.’s version of ILK. This work also opens promisful horizons to the study of other combinatorial optimization problems such as the quadratic assignment problem.
منابع مشابه
New Approaches in Meta-heuristics to Schedule Purposeful Inspections of Workshops in Manufacturing Supply Chains
Nowadays, with the growth of technology and the industrialization of societies, work-related accidents, and consequently the threat of human capital and material resources are among the problems of the countries of the world. The most important legal solution in most countries to control occupational accidents and illnesses is to conduct periodic site visits and identify hazardous sites. To the...
متن کاملA Comparison of Four Multi-Objective Meta-Heuristics for a Capacitated Location-Routing Problem
In this paper, we study an integrated logistic system where the optimal location of depots and vehicles routing are considered simultaneously. This paper presents a new mathematical model for a multi-objective capacitated location-routing problem with a new set of objectives consisting of the summation of economic costs, summation of social risks and demand satisfaction score. A new multi-objec...
متن کاملMemetic Algorithms and Fitness Landscapes in Combinatorial Optimization
Combinatorial optimization problems (COPs) arise in many practical applications in the fields of management science, biology, chemistry, physics, engineering, and computer science. Although the search space is comprised of a finite number of candidate solutions, many of these problems are very complex and thus hard to solve. Often, the search space grows exponentially with the problem size rend...
متن کاملEffective heuristics and meta-heuristics for the quadratic assignment problem with tuned parameters and analytical comparisons
Quadratic assignment problem (QAP) is a well-known problem in the facility location and layout. It belongs to the NP-complete class. There are many heuristic and meta-heuristic methods, which are presented for QAP in the literature. In this paper, we applied 2-opt, greedy 2-opt, 3-opt, greedy 3-opt, and VNZ as heuristic methods and tabu search (TS), simulated annealing, and pa...
متن کاملThree Meta-heuristic Algorithms for the Single-item Capacitated Lot-sizing Problem (RESEARCH NOTE)
This paper proposes a mixed integer programming model for single-item capacitated lot-sizing problem with setup times, safety stock, demand shortages, outsourcing and inventory capacity. Due to the complexity of problem, three meta-heuristics algorithms named simulated annealing (SA), vibration damping optimization (VDO) and harmony search (HS) have been used to solve this model. Additionally, ...
متن کامل